Three-matching intersection conjecture for perfect matching polytopes of small dimensions

Srikumar 1 Perfect Matching and Matching Polytopes

Matching Integral Graphs of Small Order

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

Fractional Perfect b-Matching Polytopes. I: General Theory

Abstract. The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v is a prescribed nonnegative number bv. General theorems which provide conditions for nonemptiness, give a formula for the dimension, and characterize the vertices, e...

Evaluation of Similarity Measures for Template Matching

Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...

Perfect Matching Preservers

For two bipartite graphs G and G , a bijection ψ : E(G) → E(G) is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if ψ(M) is a perfect matching in G. We characterize bipartite graphs G and G which are related by a matching preserver and the matching preservers between them.